https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 Strong edge-magic graphs of maximum size https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:4997 Wed 11 Apr 2018 10:44:45 AEST ]]> Antimagic labeling of graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:13369 Tue 11 Dec 2018 16:56:59 AEDT ]]> Super (a, 3)-edge-antimagic total labelings for union of two stars https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:29690 (a,d)-edge antimagic total labeling of a (p, q)-graph G is bijection f:V∪E→{1,2,3,…,p+q} with the property that the edge-weights w(uv)=f(u)+f(v)+f(uv) where uv∈E(G) form an arithmetic progression a,a+d,…,a+(q−1)d, where a > 0 and d ≥ 0 are two fixed integers. If such a labeling exists, then G is called an (a,d)-edge antimagic total graph. If further the vertex labels are the integers {1,2,3,…,p}, then f is called a super (a,d)-edge antimagic total labeling of G ((a, d)-SEAMT labeling) and a graph which admits such a labeling is called a super (a,d)-edge antimagic total graph ((a, d)-SEAMT graph). If d=0, then the graph G is called a super edge-magic graph. In this paper we investigate the existence of super (a, 3)-edge antimagic total labelings for union of two stars.]]> Sat 24 Mar 2018 07:38:47 AEDT ]]>